Reliable computing: numerical and rounding errors

نویسنده

  • Tomasz Strek
چکیده

The arithmetic performed in a machine involves numbers with only a finite number of digits, with the results that many calculations are performed with approximate representations of the actual numbers. In typical computer, only a relatively small subset of the real number system is used for the representation of all real numbers. This subset contains only rational numbers, both positive and negative, and stores a fractional part, called the mantisa, together with an exponential part, called the characteristic. Floating point systems are specified by four parameters, Fl(B,p,L,U) , and elements of these systems are specified by three parameters, (s,m,e): • s is the sign of a floating-point number, • m is its (unsigned) mantissa, and • e is its exponent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Accuracy of the Solution of Linear Problems on the CELL Processor

Several super computers have been designed as massively parallel computers using the CELL processor as their main component. Such is for example the IBM Roadrunner which broke the world computing speed record in June 2008. However, even if machines of this kind are absolutely necessary to solve numerical problems that could not be solved otherwise, the question of the accuracy of the solution m...

متن کامل

Finding the Smallest Eigenvalue by Properties of Semidefinite Matrices

We consider the smallest eigenvalue problem for symmetric or Hermitian matrices by properties of semidefinite matrices. The work is based on a floating-point Cholesky decomposition and takes into account all possible computational and rounding errors. A computational test is given to verify that a given symmetric or Hermitian matrix is not positive semidefinite, so it has at least one negative ...

متن کامل

Termination and Verification for Ill-Posed Semidefinite Programming Problems

We investigate ill-posed semidefinite programming problems for which Slater’s constraint qualifications fail, and propose a new reliable termination criterium dealing with such problems. This criterium is scale-independent and provides verified forward error bounds for the true optimal value, where all rounding errors due to floating point arithmetic are taken into account. It is based on a bou...

متن کامل

A Note on a Verified Automatic Integration Algorithm

A verified integration algorithm is proposed for calculating s-dimensional integrals over a finite domain using numerical computations. To construct an efficient verified numerical integrator, the truncation error and the rounding error need to be considered. It has been known that interval arithmetic is one of the most efficient methods of evaluating the rounding error. However, it is much slo...

متن کامل

Rigorous Numerics in Dynamics

Motivation Nonlinear dynamics shape the world around us, from the harmonious movements of celestial bodies, via the swirling motions in fluid flows, to the complicated biochemistry in the living cell. Mathematically these beautiful phenomena are modeled by nonlinear dynamical systems, mainly in the form of ordinary differential equations (ODEs), partial differential equations (PDEs) and delay d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003